Smooth Uniform Crossover with Smooth Point Mutation in Genetic Programming: A Preliminary Study
نویسندگان
چکیده
In this paper we examine the behaviour of the uniform crossover and point mutation GP operators 12] on the even-n-parity problem for n = 3; 4; 6 and present a novel representation of function nodes, designed to allow the search operators to make smaller movements around the solution space. Using this representation, performance on the even-6-parity problem is improved by three orders of magnitude relative to the estimate given for standard GP in 5].
منابع مشابه
A uniform approximation method to solve absolute value equation
In this paper, we propose a parametric uniform approximation method to solve NP-hard absolute value equations. For this, we uniformly approximate absolute value in such a way that the nonsmooth absolute value equation can be formulated as a smooth nonlinear equation. By solving the parametric smooth nonlinear equation using Newton method, for a decreasing sequence of parameters, we can get the ...
متن کاملDimensionality Reduction and Improving the Performance of Automatic Modulation Classification using Genetic Programming (RESEARCH NOTE)
This paper shows how we can make advantage of using genetic programming in selection of suitable features for automatic modulation recognition. Automatic modulation recognition is one of the essential components of modern receivers. In this regard, selection of suitable features may significantly affect the performance of the process. Simulations were conducted with 5db and 10db SNRs. Test and ...
متن کاملSmooth Uniform Crossover, Sub-Machine Code GP and Demes: A Recipe For Solving High-Order Boolean Parity Problems
We describe a recipe to solve very large parity problems using GP. The recipe includes: smooth uniform crossover (a crossover operator inspired by our theoretical research), sub-machine-code GP (a technique to speed up fitness evaluation in Boolean classification problems), and interacting demes (sub-populations) running on separate workstations. We tested this recipe on parity problems with up...
متن کاملA Novel Experimental Analysis of the Minimum Cost Flow Problem
In the GA approach the parameters that influence its performance include population size, crossover rate and mutation rate. Genetic algorithms are suitable for traversing large search spaces since they can do this relatively fast and because the mutation operator diverts the method away from local optima, which will tend to become more common as the search space increases in size. GA’s are base...
متن کاملA New Genetic Algorithm Approach to Smooth Path Planning for Mobile Robots
In this paper, the smooth path planning problem is considered for a mobile robot based on the genetic algorithm and the Bezier curve. The workspace of a mobile robot is described by a new grid-based representation (2 × 2n grids) that facilitates the operations of the adopted genetic algorithm. The chromosome of the genetic algorithm is composed of a sequence of binary numbered grids (i.e., cont...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999